Background, Reserve, and Gandy Machines

Causal sets for geometrical Gandy machines and Gandy machines over multisets

A new approach to the computational complexity beyond the known complexity measures of the consumed time and space of computation is proposed. The approach focuses on the chaotic behaviour and randomness aspects of computational processes and bases on a representation of these processes by causal sets. The abstract systems allowing some synchronized parallelism of computation are investigated w...

Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata

Epithermal Gold and Base Metal Mineralization at Gandy Deposit, North of Central Iran and the Role of Rhyolitic Intrusions

The Gandy gold-base metal deposit is located in Tertiary Torud-Chahshirin volcano-plutonic range, north of Central Iran. Various styles of gold mineralization occur throughout the range. Mineralization at Gandy occurs in close spatial relation with rhyolitic domes in a caldera setting in a series of narrow brecciated veins. Two mineralogically and spatially different argillic alterations have a...

Church Without Dogma: Axioms for Computability

Church’s and Turing’s theses assert dogmatically that an informal notion of effective calculability is adequately captured by a particular mathematical concept of computabilty. I present analyses of calculability that are embedded in a rich historical and philosophical context, lead to precise concepts, and dispense with theses. To investigate effective calculability is to analyze processes tha...

What Is an Algorithm?

0 Preamble We present a two-part exposition on the notion of algorithm and foun-dational analyses of computation. The first part is below, and the second is here: In the first part, after a short introduction, we clarify some common misconceptions related to Turing's analysis of computation, consider whether the notion of algorithm can be rigorously defined in full generality, discuss what kind...